How Much Optimal Dilation Improves on the Classical Solution|the Canonical Connguration

ثبت نشده
چکیده

from which numerical optimization of r is commenced|with respect to (i) the value of r and (ii) the probability of converging to a global minimizer of r. We expect to address these issues empirically, by extensive computational experimentation, but we have some hope of a theoretical analysis in the comparatively tractable case of 2. 3. How can Theorem 1 be exploited for global optimization? It is apparent from Theorem 1 that the stationary conngurations of r have considerable structure. Furthermore, part (iii) of Theorem 1 suggests a strategy for globally optimizing r. Because we now understand that these observations apply to any r , not just the case of r = 2 addressed by Glunt, Hayden, and Liu (1991), the potential gains from exploiting them are greatly increased.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical wavelet systems over finite fields

This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...

متن کامل

Inputs and Outputs Estimation in Inverse DEA

The present study addresses the following question: if among a group of decision making units, the decision maker is required to increase inputs and outputs to a particular unit in which the DMU, with respect to other DMUs, maintains or improves its current efficiencylevel, how much should the inputs and outputs of the DMU increase? This question is considered as a problem of inverse data envel...

متن کامل

Trajectory Planning in a Dynamic Workspace: a `state-time Space' Approach Trajectory Planning in a Dynamic Workspace: a `state-time Space' Approach

| This paper addresses trajectory planning in a dynamic workspace, i.e. motion planning for a robot subject to dynamic constraints and moving in a workspace with moving obstacles. First is introduced the novel concept of state-time space, i.e. the state space of the robot augmented of the time dimension. Like connguration space which is a tool to formulate path planning problems, state-time spa...

متن کامل

Trajectory Planning in Dynamic Workspaces: a `state-time Space' Approach Trajectory Planning in Dynamic Workspaces: a `state-time Space' Approach

| This paper addresses trajectory planning in dynamic workspaces, i.e. trajectory planning for a robot subject to dynamic constraints and moving in a workspace with moving obstacles. First is introduced the novel concept of state-time space, i.e. the state space of the robot augmented of the time dimension. Like the concept of connguration space which is a tool to formulate path planning proble...

متن کامل

One-for-One Period Policy and its Optimal Solution

In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000